翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

nonlinear eigenproblem : ウィキペディア英語版
nonlinear eigenproblem
A nonlinear eigenproblem is a generalization of an ordinary eigenproblem to equations that depend nonlinearly on the eigenvalue. Specifically, it refers to equations of the form:
:A(\lambda) \mathbf = 0 , \,
where x is a vector (the nonlinear "eigenvector") and ''A'' is a matrix-valued function of the number \lambda (the nonlinear "eigenvalue"). (More generally, A(\lambda) could be a linear map, but most commonly it is a finite-dimensional, usually square, matrix.) ''A'' is usually required to be a holomorphic function of \lambda (in some domain).
For example, an ordinary linear eigenproblem B\mathbf = \lambda \mathbf, where ''B'' is a square matrix, corresponds to A(\lambda) = B - \lambda I, where ''I'' is the identity matrix.
One common case is where ''A'' is a polynomial matrix, which is called a polynomial eigenvalue problem. In particular, the specific case where the polynomial has degree two is called a quadratic eigenvalue problem, and can be written in the form:
:A(\lambda) \mathbf = ( A_2 \lambda^2 + A_1 \lambda + A_0) \mathbf = 0 , \,
in terms of the constant square matrices ''A''0,1,2. This can be converted into an ordinary linear generalized eigenproblem of twice the size by defining a new vector \mathbf = \lambda \mathbf. In terms of x and y, the quadratic eigenvalue problem becomes:
:\begin -A_0 & 0 \\ 0 & I \end \begin \mathbf \\ \mathbf \end = \lambda
\begin A_1 & A_2 \\ I & 0 \end \begin \mathbf \\ \mathbf \end
,
where ''I'' is the identity matrix. More generally, if ''A'' is a matrix polynomial of degree ''d'', then one can convert the nonlinear eigenproblem into a linear (generalized) eigenproblem of ''d'' times the size.
Besides converting them to ordinary eigenproblems, which only works if ''A'' is polynomial, there are other methods of solving nonlinear eigenproblems based on the Jacobi-Davidson algorithm or based on Newton's method (related to inverse iteration).
==References==

* Françoise Tisseur and Karl Meerbergen, "The quadratic eigenvalue problem," ''SIAM Review'' 43 (2), 235-286 (2001).
* Gene H. Golub and Henk A. van der Vorst, "Eigenvalue computation in the 20th century," ''Journal of Computational and Applied Mathematics'' 123, 35-65 (2000).
* Philippe Guillaume, "Nonlinear eigenproblems," ''SIAM J. Matrix. Anal. Appl.'' 20 (3), 575-595 (1999).
* Axel Ruhe, "Algorithms for the nonlinear eigenvalue problem," ''SIAM Journal on Numerical Analysis'' 10 (4), 674-689 (1973).

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「nonlinear eigenproblem」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.